Forecast scheduling and its extensions to account for random events
نویسندگان
چکیده
Technology evolutions make possible the use of Geo-Localized Measurements (GLM) for performance and quality of service optimization thanks to the Minimization of Drive Testing (MDT) feature. Exploiting GLM in radio resource management is a key challenge in future networks. The Forecast Scheduling (FS) concept that uses GLM in the scheduling process has been recently introduced. It exploits long term time and spatial diversity of vehicular users in order to improve user throughputs and quality of service. In a previous paper we have formulated the FS as a convex optimization problem namely the maximization of an α−fair utility function of the cumulated downlink data rates of the users along their trajectories. This paper proposes an extension for the FS model to take into account different types of random events such as arrival and departure of users and uncertainties in the mobile trajectories. Simulation results illustrate the significant performance gain achieved by the FS algorithms in the presence of random events. a
منابع مشابه
Analysis and Forecast of Mining Accidents in Pakistan
In the mining sector, the barrier to obtain an efficient safety management system is the unavailability of future information regarding the accidents. This paper aims to use the auto-regressive integrated moving average (ARIMA) model, for the first time, to evaluate the underlying causes that affect the safety management system corresponding to the number of accidents and fatalities in the surf...
متن کاملProject resource investment problem under progress payment model
As a general branch of project scheduling problems, resource investment problem (RIP) considers resource availabilities as decision variables to determine a level of employed resources minimizing the costs of the project. In addition to costs (cash outflows), researchers in the later extensions of the RIP took payments (cash inflows) received from clients into account and used the net present v...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملNet Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems
While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...
متن کاملNet Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems
While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...
متن کامل